Edge-disjoint Hamilton cycles in random graphs
نویسندگان
چکیده
We show that provided log n/n ≤ p ≤ 1 − n−1/4 log n we can with high probability find a collection of bδ(G)/2c edge-disjoint Hamilton cycles in G ∼ Gn,p, plus an additional edge-disjoint matching of size bn/2c if δ(G) is odd. This is clearly optimal and confirms, for the above range of p, a conjecture of Frieze and Krivelevich.
منابع مشابه
Hamilton decompositions of regular expanders: Applications
In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this theorem is that every regular tournament on n vertices can be decomposed into (n − 1)/2 edge-disjoint Hamilton cycles, whenever n is sufficiently large. This v...
متن کاملOn covering expander graphs by hamilton cycles
The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum degree ∆ satisfies some basic expansion properties and contains a family of (1−o(1))∆/2 edge disjoint Hamilton cycles, then there also exists a covering of its...
متن کاملOptimal Packings of Hamilton Cycles in Sparse Random Graphs
We prove that there exists a positive constant ε such that if log n/n ≤ p ≤ n−1+ε, then asymptotically almost surely the random graph G ∼ G(n, p) contains a collection of bδ(G)/2c edge-disjoint Hamilton cycles.
متن کاملSymmetry and optimality of disjoint Hamilton cycles in star graphs
Multiple edge-disjoint Hamilton cycles have been obtained in labelled star graphs Stn of degree n-1, using number-theoretic means, as images of a known base 2-labelled Hamilton cycle under label-mapping automorphisms of Stn. However, no optimum bounds for producing such edge-disjoint Hamilton cycles have been given, and no positive or negative results exist on whether Hamilton decompositions ca...
متن کاملAutomorphisms generating disjoint Hamilton cycles in star graphs
In the first part of the thesis we define an automorphism φn for each star graph Stn of degree n − 1, which yields permutations of labels for the edges of Stn taken from the set of integers {1, . . . , bn/2c}. By decomposing these permutations into permutation cycles, we are able to identify edge-disjoint Hamilton cycles that are automorphic images of a known two-labelled Hamilton cycle H1 2(n)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 46 شماره
صفحات -
تاریخ انتشار 2015